Counting Linear Extensions of Posets with Determinants of Hook Lengths

نویسندگان

چکیده

We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete such that their number linear extensions is given by determinant matrix whose entr...

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Linear Extensions of Sparse Posets

Counting the linear extensions of a partially ordered set (poset) is a fundamental problem with several applications. We present two exact algorithms that target sparse posets in particular. The first algorithm breaks the counting task into subproblems recursively. The second algorithm uses variable elimination via inclusion–exclusion and runs in polynomial time for posets with a cover graph of...

متن کامل

Generating linear extensions of posets by transpositions

This paper considers the problem of listing all linear extensions of a partial order so that successive extensions diier by the transposition of a single pair of elements. A necessary condition is given for the case when the partial order is a forest. A necessary and suucient condition is given for the case where the partial order consists of disjoint chains. Some open problems are mentioned.

متن کامل

Pattern Avoiding Linear Extensions of Rectangular Posets

In [Yak15] Yakoubov introduced an extensive new family of permutation enumeration problems. To state the most general of these problems, suppose n is a positive integer, ⇑ is a partial order on [n], and σ1, . . . , σk are permutations. Then Yakoubov’s problem is to determine how many permutations π of [n] avoid σ1, . . . , σk and also have the property that if π(i) ⇑ π(j) then i < j. In other w...

متن کامل

Permutation statistics and linear extensions of posets

We consider subsets of the symmetric group for which the inversion index and major index are equally distributed. Our results extend and unify results of MacMahon, Foata, and Schtitzenberger, and the authors. The sets of permutations under study here arise as linear extensions of labeled posets, and more generally as order closed subsets of a partial ordering of the symmetric group called the w...

متن کامل

Note on a Ramsey Theorem for Posets with Linear Extensions

In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao (2017).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2021

ISSN: ['1095-7146', '0895-4801']

DOI: https://doi.org/10.1137/20m1320730